package algorithm.view.sort.insert;

/**
 * @author bingo
 * @Description
 * @Date 2018/6/13
 */
public class InsertSortData {

    private int[] numbers;

    public int  orderedIndex=-1;

    public int  currentIndex=0;

    public int  compareToIndex=0;



    public InsertSortData(int N,int maxBound) {

        numbers = new int[N];
        for(int i=0;i<N;i++){
            numbers[i]=(int)(Math.random()*maxBound)+1;
        }


    }

    public int  N(){
        return numbers.length;
    }

    public int get(int index){

        return  numbers[index];
    }

    public void swap(int i,int j){

        int temp = numbers[i];
        numbers[i] = numbers[j];
        numbers[j]=temp;
    }


}
